The greedy triangulation can be computed from the Delaunay triangulation in linear time
نویسندگان
چکیده
منابع مشابه
Splitting a Delaunay Triangulation in Linear Time1
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can be designed. Given two sets of points, we prove that, if the Delaunay triangulation of all the points is known, the Delaunay triangulation of each set can be computed in randomized expected linear time.
متن کاملHexagonal Delaunay Triangulation
We present a novel and robust algorithm for triangulating point clouds in R. It is based on a highly adaptive hexagonal subdivision scheme of the input domain. That hexagon mesh has a dual triangular mesh with the following properties: • any angle of any triangle lies in the range between 43.9◦ and 90◦, • the aspect ratio of triangles is bound to 1.20787, • the triangulation has the Delaunay pr...
متن کاملParallel 3D Delaunay Triangulation
The paper deals with the parallelization of Delaunay triangulation algorithms, giving more emphasis to pratical issues and implementation than to theoretical complexity. Two parallel implementations are presented. The first one is built on DeWall, an E triangulator based on an original interpretation of the divide & conquer paradigm. The second is based on an incremental construction algorithm....
متن کاملDelaunay Triangulation of Manifolds
We present an algorithmic framework for producing Delaunay triangulations of manifolds. The input to the algorithm is a set of sample points together with coordinate patches indexed by those points. The transition functions between nearby coordinate patches are required to be bi-Lipschitz with a constant close to 1. The primary novelty of the framework is that it can accommodate abstract manifo...
متن کاملDelaunay Triangulation Benchmarks
In this communication we propose an initial set of 2D Delaunay triangulation benchmarks for checking the correctness of algorithms and discovering possible flaws. A tool for verification of the generated triangulation is provided. The tool reports typical errors like the existence of unused points, missing edges, non-Delaunay triangles or degenerated triangles. While the tool has been primarily...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1999
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(99)00037-1